The homogeneous weight for $R_k$, related Gray map and new binary quasicyclic codes

نویسندگان

  • Bahattin Yildiz
  • Ismail G. Kelebek
چکیده

Using theoretical results about the homogeneous weights for Frobenius rings, we describe the homogeneous weight for the ring family Rk, a recently introduced family of Frobenius rings which have been used extensively in coding theory. We find an associated Gray map for the homogeneous weight using first order Reed-Muller codes and we describe some of the general properties of the images of codes over Rk under this Gray map. We then discuss quasitwisted codes over Rk and their binary images under the homogeneous Gray map. In this way, we find many optimal binary codes which are selforthogonal and quasicyclic. In particular, we find a substantial number of optimal binary codes that are quasicyclic of index 8, 16 and 24, nearly all of which are new additions to the database of quasicyclic codes kept by Chen.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-weight codes from trace codes over $R_k$

We construct a family of two-Lee-weight codes over the ring Rk, which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain optimal abelian binary two-weight codes by using the Griesmer bound. An application to secret sharing schemes is also given.

متن کامل

New extremal binary self-dual codes of lengths 66 and 68 from codes over r_k, m

In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R k,m. Extremal binary self-dual codes of length 64 are obtained as Gray images of λ-four circulant codes over R 2,1 and R 2,2. Extremal binary self-dual codes of lengths 66 and 68 are con...

متن کامل

Linear Codes over Galois Ring GR(p2, r) Related to Gauss sums

Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes over Z4. In this paper we consider two series of linear codes C(G) and C̃(G) over Galois ring R = GR(p2,r), where G is a subgroup of R(s) ∗ and R(s) = GR(p2,rs...

متن کامل

On Z2k-Dual Binary Codes

A new generalization of the Gray map is introduced. The new generalization Φ : Z 2 → Z k−1 n 2 is connected with the known generalized Gray map φ in the following way: if we take two dual linear Z2k -codes and construct binary codes from them using the generalizations φ and Φ of the Gray map, then the weight enumerators of the binary codes obtained will satisfy the MacWilliams identity. The cla...

متن کامل

Simplex and MacDonald Codes over $R_{q}$

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring R q = F 2 [u 1 , u 2 ,. .. , u q ]/ u 2 i = 0, u i u j = u j u i for q ≥ 1. We also consider the construction of simplex and MacDonald codes of types α and β over this ring. Further, we study the properties of these codes such as their binary images and covering radius. 1 Introduction Codes over rings have...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1504.04111  شماره 

صفحات  -

تاریخ انتشار 2015